the capacitated location-allocation problem with interval parameters
Authors
abstract
in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be reduced to the p-median problem in polynomial time so it is np-hard. a genetic algorithm is proposed to solve the developed model and experimental results of solving the model are presented.
similar resources
The Capacitated Location-Allocation Problem with Interval Parameters
In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be redu...
full textModeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)
The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...
full textModeling capacitated location – allocation problem with fuzzy demands q
In order to model capacitated location–allocation problem with fuzzy demands, three types of fuzzy programming models – fuzzy expected cost minimization model, fuzzy a-cost minimization model, and credibility maximization model – are proposed according to different decision criteria. For solving these models, some hybrid intelligent algorithms are also designed. Finally, several numerical exper...
full textModeling capacitated location-allocation problem with fuzzy demands
In order to model capacitated location-allocation problem with fuzzy demands, three types of fuzzy programming models — fuzzy expected cost minimization model, fuzzy α-cost minimization model, and credibility maximization model — are proposed according to different decision criteria. For solving these models, some hybrid intelligent algorithms are also designed. Finally, several numerical exper...
full textA Nonlinear Model for a Capacitated Location-allocation Problem with Bernoulli Demand using Sub-sources
This study presents a capacitated multi-facility location-allocation problem with stochastic demands based on a well-known distribution function. In this discrete environment, besides the capacitated facilities, we can employee the capacitated sub-source of each facility for satisfying demands of customers. The objective function is to find the optimal locations of facilities among a finite num...
full textGlobal Optimization Approach for the Capacitated Euclidean Location-Allocation Problem
In this chapter, we present a procedure that seeks the global minimum for the capacitated Euclidean location-allocation problem which is defined as follows. Given the fixed location of m existing facilities or customers on a continuous plane and their associated demands, we wish to determine the location of n new facilities or sources with known capacities, and the allocation of its supply, in ...
full textMy Resources
Save resource for easier access later
Journal title:
journal of optimization in industrial engineeringPublisher: qiau
ISSN 2251-9904
volume Volume 1
issue Issue 2 2010
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023